منابع مشابه
Toward an Algebraic Theory of Systems
We propose the concept of a system algebra with a parallel composition operation and an interface connection operation, and formalize composition-order invariance, which postulates that the order of composing and connecting systems is irrelevant, a generalized form of associativity. Composition-order invariance explicitly captures a common property that is implicit in any context where one can ...
متن کاملToward an Algebraic Theory for Turbo Codes
Instead of a random interleaver, an algebraic interleaver interconnecting two simple convolutional codes with feedback encoders forms an algebraic quasi-cyclic code. An (nC , k) convolutional code in tailbiting form becomes a quasi-cyclic (QC) linear code of length LnC for some L = Mn. Interleavers with a period M connect two such codes to produce a QC turbo code. The QC turbo codes check equat...
متن کاملAn Algebraic Theory of Type-and-Effect Systems
We present a general semantic account of Gifford-style type-and-effect systems. These type systems provide lightweight static analyses annotating program phrases with the sets of possible computational effects they may cause, such as memory access and modification, exception raising, and non-deterministic choice. The analyses are used, for example, to justify the program transformations typical...
متن کاملAn Algebraic Theory
We give an algebraic formalization of SLD-trees and their abstractions (ob-servables). We can state and prove in the framework several useful theorems (AND-compositionality, correctness and full abstraction of the denotation, equivalent top-down and bottom-up constructions) about semantic properties of various observables. Observables are represented by Galois co-insertions and can be used to m...
متن کاملAn Algebraic Schwarz Theory
SCHWARZ THEORY 27 Algorithm 4.1 (Abstract Multiplicative Schwarz Method { Implementation Form) un+1 = MS(un; f) where the operation uNEW = MS(uOLD; f) is de ned as: Do k = 1; : : : ; J rk = IT k (f AuOLD) ek = Rkrk uNEW = uOLD + Ikek uOLD = uNEW End do. Note that the rst step through the loop in MS( ; ) gives: uNEW = uOLD + I1e1 = uOLD + I1R1IT 1 (f AuOLD) = (I I1R1IT 1 A)uOLD + I1R1IT 1 f: Con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2018
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2018.06.001